#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n,a[100005],b[100005];
queue<int>q;
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin >> n;
	
	for(int i = 1; i <= n;i++){
		cin >> a[i];
	}
	sort(a+1,a+n+1);
	int cnt = n;
	q.push(a[1]);
	for(int i = 2; i <= n;i++){
		if(q.front()<a[i]){
			cnt--;
			q.pop();
		}
		q.push(a[i]);
	}
	cout << cnt;
	return 0;
}